An Existing Problem for Symmetric Design: Bruck Ryser Chowla Theorem

نویسندگان

چکیده

Symetric designs are interesting objects of combinatorics, and have some relations with coding theory, difference sets, geometry finite group theory. They applications on statistics design experiments. In the present paper we study an existing problem for symmetric due to Bruck, Ryser Chowla write algorithm by using their theorem called BRC Theorem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A problem of Chowla revisited

p ∑ n=1 f (n)= 0 and ∑∞ n=1 f (n)/n = 0? Chowla conjectured that there was no such function. Later that year, Chowla proved a special case of his conjecture and in a subsequent paper, asked if the condition that f (p) = 0 can be dropped. In 1973, Baker, Birch and Wirsing, using the theory of linear forms in logarithms obtained a general theorem, a special case of which implies the conjecture of...

متن کامل

Conditions for singular incidence matrices

Suppose one looks for a square integral matrix N , for which NN has a prescribed form. Then the Hasse-Minkowski invariants and the determinant of NN lead to necessary conditions for existence. The Bruck-Ryser-Chowla theorem gives a famous example of such conditions in case N is the incidence matrix of a square block design. This approach fails when N is singular. In this paper it is shown that ...

متن کامل

Some Remarks on a Problem of Chowla

Cette conjecture fut par la suite prouvée et généralisée par Baker, Birch et Wirsing. Dans leur article conjoint, Baker, Birch et Wirsing affirment que Chowla a aussi résolu le cas particulier que ce dernier a énoncé, mais ne donnent aucune indication sur le genre de démonstration effectuée. En nous basant sur certains articles préalablement écrits par Chowla, nous essayons de reconstruire ce q...

متن کامل

Theorem for an Inverse Problem

Let VZu+k2u+k2a~(z)u+V.(a~(~)Vu) = -6(cc-y) inR3, where al(z) EL’(D), a&) E H’(D), D E R3_ = {z : 13 < 0) is a finite region, aj(Z) = 0 outside of D, j = 1,2, 1 + 02 > 0, al = El. Assume that thedatau(l,y,k),V~,yEP={I:13=0}8ndallkE(O,ko),ko>O is an arbitrary small number, are given. THEOREM. The above data determine aj(z), j = 1,2, uniquely.

متن کامل

An improved infeasible‎ ‎interior-point method for symmetric cone linear complementarity‎ ‎problem

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sakarya University Journal of Science

سال: 2022

ISSN: ['1301-4048', '2147-835X']

DOI: https://doi.org/10.16984/saufenbilder.962817